A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems

نویسندگان

  • Mohammad Jalali Varnamkhasti
  • Lai Soon Lee
چکیده

The fundamental problem in genetic algorithms is premature convergence, and it is strongly related to the loss of genetic diversity of the population. This study aims at proposing some techniques to tackle the premature convergence by controlling the population diversity. Firstly, a sexual selection mechanism which utilizes the mate chromosome during selection is used. The second technique focuses on controlling the genetic parameters by applying the fuzzy logic controller. Computational experiments are conducted on the proposed techniques and the results are compared with other genetic operators, heuristics, and local search algorithms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimization Algorithm Based on the Small-World Phenomenon

We propose an optimization algorithm, called the small-world algorithm (SWA), based on searching mechanisms in social networks. The SWA emphasizes local rather than global search to find the solutions for optimization problems. We investigate two encoding strategies, binary encoding and decimal encoding, in the SWA and test them by function optimization and 01 multidimensional knapsack problems...

متن کامل

A Genetic Algorithm with Fuzzy Crossover Operator and Probability

The performance of a genetic algorithm is dependent on the genetic operators, in general, and on the type of crossover operator, in particular. The population diversity is usually used as the performance measure for the premature convergence. In this paper, a fuzzy genetic algorithm is proposed for solving binary encoded combinatorial optimization problems. A new crossover operator and probabil...

متن کامل

A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

Binary optimization problems are in the most case the NP-hard problems that call to satisfy an objective function with or without constraints. Various optimization problems can be formulated in binary expression whither they can be resolved in easier way. Optimization literature supplies a large number of approaches to find solutions to binary hard problems. However, most population-based algor...

متن کامل

Sexual selection and evolution of male and female choice in genetic algorithm

Variety and diversity of population are essential for convergence to global optimal in genetic algorithm. In this study, the concepts of fitness distribution, expected and cumulative fitness distribution, reproduction rate and loss of diversity are defined for a sexual selection mechanism, and their performance of this type of selection mechanism is studied theoretically. Then a genetic algorit...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Mathematics

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012